Quasi-greedy systems of integer translates

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Greedy and Quasi-greedy Expansions in Non-integer Bases

We generalize several theorems of Rényi, Parry, Daróczy and Kátai by characterizing the greedy and quasi-greedy expansions in non-integer bases.

متن کامل

Quasi - Greedy Triangulations Approximating

This paper settles the following two longstanding open problems: 1. What is the worst-case approximation ratio between the greedy and the minimum weight triangulation? 2. Is there a polynomial time algorithm that always produces a triangulation whose length is within a constant factor from the minimum? The answer to the rst question is that the known (p n) lower bound is tight. The second quest...

متن کامل

Democratic systems of translates

Democratic systems arise in the context of greedy approximations in Banach spaces. The greedy algorithm is an important method in numerical mathematics; for more details see the early work of V. N. Temlyakov [16], [17]. At the same time it also points to some interesting issues in functional analysis. In particular, we would like to emphasize the basic theorem of S. V. Konyagin and V. N. Temlya...

متن کامل

On Multivariate Approximation by Integer Translates of a Basis Function

Approximation properties of the dilations of the integer translates of a smooth function, with some derivatives vanishing at infinity, are studied. The results apply to fundamental solutions of homogeneous elliptic operators and to “shifted” fundamental solutions of the iterated Laplacian. Following the approach from spline theory, the question of polynomial reproduction by quasiinterpolation i...

متن کامل

Integer Quadratic Quasi-polyhedra

This paper introduces two fundamental families of ‘quasipolyhedra’ — polyhedra with a countably infinite number of facets — that arise in the context of integer quadratic programming. It is shown that any integer quadratic program can be reduced to the minimisation of a linear function over a quasi-polyhedron in the first family. Some fundamental properties of the quasi-polyhedra are derived, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 2008

ISSN: 0021-9045

DOI: 10.1016/j.jat.2008.04.009